An Equation-Based Classical Logic
نویسندگان
چکیده
We propose and study a logic able to state and reason about equational constraints, by combining aspects of classical propositional logic, equational logic, and quantifiers. The logic has a classical structure over an algebraic base, and a form of universal quantification distinguishing between local and global validity of equational constraints. We present a sound and complete axiomatization for the logic, parameterized by an equational specification of the algebraic base. We also show (by reduction to SAT) that the logic is decidable, under the assumption that its algebraic base is given by a convergent rewriting system, thus covering an interesting range of examples. As an application, we analyze offline guessing attacks to security protocols, where the equational base specifies the algebraic properties of the cryptographic primitives.
منابع مشابه
Review and Classification of Modeling Approaches of Soil Hydrology Processes
To use soil hydrology processe (SHP) models, which have increasingly extended during the last years, comprehensive knowledge about these models and their modeling approaches seems to be necessary. The modeling approaches can be categorized as either classical or non-classical. Classical approaches mainly model the SHP through solving the general unsaturated flow (Richards) equation, numerically...
متن کاملReview and Classification of Modeling Approaches of Soil Hydrology Processes
To use soil hydrology processes (SHP) models, which have increasingly extended during the last years, comprehensive knowledge about these models and their modeling approaches seems to be necessary. The modeling approaches can be categorized as either classical or non-classical. Classical approaches mainly model the SHP through solving the general unsaturated flow (Richards) equation, numericall...
متن کاملAn Executive Approach Based On the Production of Fuzzy Ontology Using the Semantic Web Rule Language Method (SWRL)
Today, the need to deal with ambiguous information in semantic web languages is increasing. Ontology is an important part of the W3C standards for the semantic web, used to define a conceptual standard vocabulary for the exchange of data between systems, the provision of reusable databases, and the facilitation of collaboration across multiple systems. However, classical ontology is not enough ...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملNon-monotonic modal logic of belief
We propose an alternative non-monotonic modal formalism called non-monotonic modal logic of belief. It is based on replacing the classical fixpoint equation E = ThS(A ∪ {Mφ : E 6`S ¬φ}) with the belief fixpoint equation E = ThS(A ∪ {Mφ : E 6`S ¬Mφ}). The solutions of the belief fixpoint equation, called belief S-expansions, are tightly related to the logic of belief KD45. We show interpretation...
متن کاملSOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC
In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.
متن کامل